The rapid mixing of random walks defined by an n-cube

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stratiied Random Walks on the N-cube

In this paper we present a method for analyzing a general class of ramdom walks on the n-cube (and certain subgraphs of it). These walks all have the property that the transition probabilities depend only on the level of the point the walk is at. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to guarantee that the resulting distribution is clos...

متن کامل

Stratiied Random Walks on the N-cube

In this paper we present a method for analyzing a general class of ramdom walks on the n cube and certain subgraphs of it These walks all have the property that the transition probabilities depend only on the level of the point the walk is at For these walks we derive sharp bounds on their mixing rates i e the number of steps required to guarantee that the resulting distribution is close to the...

متن کامل

Stratified random walks on the n-cube

In this paper we present a method for analyzing a general class of random Ž . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to Ž . guarantee that the resulting distrib...

متن کامل

On mixing times for stratified walks on the d-cube

Using the electric and coupling approaches, we derive a series of results concerning the mixing times for the stratified random walk on the d-cube, inspired in the results of Chung and Graham (1997) Stratified random walks on the n-cube. Random Structures and Algorithms, 11,199-222.

متن کامل

Deterministic Random Walks for Rapidly Mixing Chains

The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen neighbors, the rotor-router deterministically serves the neighbors in a fixed order. This paper is concerned with a generalized model, functional-router model. While the rotor-router is an analogy with a random walk consisti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2004

ISSN: 0196-8858

DOI: 10.1016/j.aam.2003.08.001